Distributed Signal Processing via Chebyshev Polynomial Approximation
نویسندگان
چکیده
منابع مشابه
Distributed Signal Processing via Chebyshev Polynomial Approximation
Unions of graph multiplier operators are an important class of linear operators for processing signals defined on graphs. We present a novel method to efficiently distribute the application of these operators. The proposed method features approximations of the graph multipliers by shifted Chebyshev polynomials, whose recurrence relations make them readily amenable to distributed computation. We...
متن کاملRadar Signal Detection in K-distributed Clutter by Pade Approximation
In this paper, two suboptimum detectors are proposed for coherent radar signal detection in K-distributed clutter. Assuming certain values for several initial moments of clutter amplitude, the characteristic function of the clutter amplitude is approximated by a limited series. Using the Pade approximation, it is then converted to a rational fraction. Thus, the pdf of the clutter amplitude is o...
متن کاملRadar Signal Detection in K-distributed Clutter by Pade Approximation
In this paper, two suboptimum detectors are proposed for coherent radar signal detection in K-distributed clutter. Assuming certain values for several initial moments of clutter amplitude, the characteristic function of the clutter amplitude is approximated by a limited series. Using the Pade approximation, it is then converted to a rational fraction. Thus, the pdf of the clutter amplitude is o...
متن کاملContinuous-time Signal Processing Based on Polynomial Approximation
A new approach for continuous-time processing of a discrete-time signal is proposed. This approach is based on simple modifications of the Farrow structure, which is a polynomial-based interpolation technique employing discrete-time filters for enabling arbitrary resampling of a time series. In this paper, an extension of the Farrow structure for other time-domain operations used for signal ana...
متن کاملChebyshev Approximation via Polynomial Mappings and the Convergence Behaviour of Krylov Subspace Methods
Abstract. Let φm be a polynomial satisfying some mild conditions. Given a set R ⊂ C, a continuous function f on R and its best approximation p n−1 from Πn−1 with respect to the maximum norm, we show that p ∗ n−1 ◦φm is a best approximation to f ◦ φm on the inverse polynomial image S of R, i.e. φm(S) = R, where the extremal signature is given explicitly. A similar result is presented for constra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal and Information Processing over Networks
سال: 2018
ISSN: 2373-776X,2373-7778
DOI: 10.1109/tsipn.2018.2824239